The Lebesgue constants on projective spaces

Lebesgue Constants and Fourier Transform

This is an attempt of a comprehensive survey of the results in which estimates of the norms of linear means of multiple Fourier series, the Lebesgue constants, are obtained by means of estimating the Fourier transform of a function generating such a method. Only few proofs are given in order to illustrate a general idea of techniques applied. Among the results are well known elsewhere as well a...

Lebesgue constants in polynomial interpolation

Lagrange interpolation is a classical method for approximating a continuous function by a polynomial that agrees with the function at a number of chosen points (the “nodes”). However, the accuracy of the approximation is greatly influenced by the location of these nodes. Now, a useful way to measure a given set of nodes to determine whether its Lagrange polynomials are likely to provide good ap...

Reproducing Kernels and Lebesgue Constants

Lebesgue constants for the weak greedy algorithm

We estimate the Lebesgue constants for the weak thresholding greedy algorithm in a Banach space relative to a biorthogonal system. The estimates involve the weakness (relaxation) parameter of the algorithm, as well as properties of the basis, such as its quasi-greedy constant and democracy function.

Lebesgue functions and Lebesgue constants in polynomial interpolation

The Lebesgue constant is a valuable numerical instrument for linear interpolation because it provides a measure of how close the interpolant of a function is to the best polynomial approximant of the function. Moreover, if the interpolant is computed by using the Lagrange basis, then the Lebesgue constant also expresses the conditioning of the interpolation problem. In addition, many publicatio...